On the Theory of Shannon-Kotel'nikov Mappings in Joint Source-Channel Coding

نویسنده

  • Pål Anders Floor
چکیده

In this thesis an approach to joint source-channel coding using direct source to channel mappings is studied. The system studied communicates i.i.d. Gaussian sources on a point-to-point Gaussian memoryless channel with limited feedback (supporting channel state information at most). The mappings, named Shannon-Kotel’nikov (SK) mappings, are memoryless mappings between the source space of dimension M and the channel space of dimension N. Such mappings can be used for error control when M < N, called dimension expansion, and for lossy compression when M > N, called dimension reduction. The SK-mappings operate on amplitude continuous and time discrete signals (meaning that there is no bits involved) through (piecewise) continuous curves or hyper surfaces in general. The reason for studying SK-mappings is that they are delay free, robust against varying channel conditions, and have quite good performance at low complexity. First a theory for determining and categorizing the distortion using SKmappings for communication is introduced and developed. This theory is further used to show that SK-mappings can reach the information theoretical bound optimal performance theoretically attainable (OPTA) when their dimension approach infinity. One problem is to determine the overall optimal geometry of the SKmappings. Indications on the overall geometry can be found by studying the codebooks and channel constellations of power constrained channel optimized vector quantizers (PCCOVQ). The PCCOVQ algorithm will find the optimal placing of quantizer representation vectors in the source space and channel symbols in the channel space. A PCCOVQ algorithm giving well performing mappings for the dimension reduction case has been found in the past. In this thesis the PCCOVQ algorithm is modified to give well performing dimension expanding mappings for scalar sources, and 1:2 and 1:3 PCCOVQ examples are given. Some example SK-mappings are proposed and analyzed. 2:1 and 1:2 PCCOVQ mappings are used as inspiration for making 2:1 and 1:2 SK-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shannon-Kotel'nikov Mappings for Analog Point-to-Point Communications

In this paper an approach to joint source-channel coding (JSCC), named Shannon-Kotel’nikov mappings (SKmappings), is presented. SK-mappings are (piecewise) continuous direct source-to-channel mappings operating directly on amplitude continuous discrete time signals. A theory for calculating and categorizing the end-to-end distortion when using SK-mappings for communication is presented. The the...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

Source - Channel Mappings with Applications to Compressed Sensing

Tandem source-channel coding is proven to be optimal by Shannon given unlimited delay and complexity in the coders. Under low delay and low complexity constraints, joint source-channel coding may achieve better performance. Although digital joint source-channel coding has shown a noticeable gain in terms of reconstructed signal quality, coding delay, and complexity, it suffers from the leveling...

متن کامل

Quantum Information Chapter 10. Quantum Shannon Theory

Contents 10 Quantum Shannon Theory 1 10.1 Shannon for Dummies 2 10.1.1 Shannon entropy and data compression 2 10.1.2 Joint typicality, conditional entropy, and mutual information 6 10.1.3 Distributed source coding 8 10.1.4 The noisy channel coding theorem 9 10.2 Von Neumann Entropy 16 10.2.1 Mathematical properties of H(ρ) 18 10.2.2 Mixing, measurement, and entropy 20 10.2.3 Strong subadditivit...

متن کامل

The FlexCode Channel Coding Approach

The FlexCode project is a joint research project of KTH Stockholm, RWTH Aachen University, Ericsson AB, Nokia Siemens Networks, and Orange/France Telecom under the umbrella of the sixth framework programme of the European Commission (http://www.flexcode.eu). In this paper we present the channel coding approach used in the FlexCode project. Furthermore, a brief introduction to the channel model ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008